Decidable logics combining heap structures and data

Decidable Navigation Logics for Object Structures

In this paper, we introduce decidable multimodal logics to describe and reason about navigation across object structures. The starting point of these navigation logics is the modelling of object structures as Kripke models that contain a family of deterministic accessibility relations; one for each pointer attribute. These pointer attributes are used in the logics both as first-order terms in e...

Decidable Logics for Transductions and Data Words

We introduce a logic, calledLT , to express proper-ties of transductions, i.e. binary relations from input to output(finite) words. InLT , the input/output dependencies are modeledvia an origin function which associates with any position of theoutput word, the input position from which it originates. The logicLT can express all MSO-definable functions, and is incompa...

Decidable metric logics

Article history: Received 15 July 2007 Revised 8 May 2008 Available online 11 October 2008 Thecommonmetric temporal logic for continuous timewereshowntobe insufficient,when it was proved that they cannot express a modality suggested by Pnueli. Moreover no finite temporal logic can express all the natural generalizations of this modality. It followed that if we look for an optimal decidable metr...

Decidable Characterizations for Tree Logics

Correctness of Data Representations Involving Heap Data Structures

While the semantics of local variables in programming languages is by now wellunderstood, the semantics of pointer-addressed heap variables is still an outstanding issue. In particular, the commonly assumed relational reasoning principles for data representations have not been validated in a semantic model of heap variables. In this paper, we define a parametricity semantics for a Pascal-like l...